Universal edge scaling in random partitions

نویسندگان

چکیده

We establish the universal edge scaling limit of random partitions with infinite-parameter distribution called Schur measure. explore asymptotic behavior wave function, which is a building block corresponding kernel, based on Schrödinger-type differential equation. show that function in general to Airy and its higher-order analogs limit. construct kernel Tracy–Widom from discuss implication multicritical phase transition large-size matrix model. also shape through semi-classical analysis function.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Random partitions and edge-disjoint Hamiltonian cycles

Nash-Williams [21] proved that every graph with n vertices and minimum degree n/2 has at least b5n/224c edge-disjoint Hamiltonian cycles. In [20], he raised the question of determining the maximum number of edge-disjoint Hamiltonian cycles, showing an upper bound of b(n+ 4)/8c. Let α(δ, n) = (δ + √ 2δn− n2)/2. Christofides, Kühn, and Osthus [7] proved that for every > 0, every graph G on a suff...

متن کامل

Canonical Partitions Of Universal Structures

Let U = (U,L) be a universal binary countable homogeneous structure and n ∈ ω. We determine the equivalence relation C(n)(U) on [U ] with the smallest number of equivalence classes r so that each one of the classes is indivisible. As a consequence we obtain

متن کامل

Random partitions in statistical mechanics

We consider a family of distributions on spatial random partitions that provide a coupling between different models of interest: the ideal Bose gas; the zero-range process; particle clustering; and spatial permutations. These distributions are invariant for a “chain of Chinese restaurants” stochastic process. We obtain results for the distribution of the size of the largest component.

متن کامل

Increments of Random Partitions

For any partition of {1, 2, . . . , n} we define its increments Xi, 1 ≤ i ≤ n by Xi = 1 if i is the smallest element in the partition block that contains it, Xi = 0 otherwise. We prove that for partially exchangeable random partitions (where the probability of a partition depends only on its block sizes in order of appearance), the law of the increments uniquely determines the law of the partit...

متن کامل

Partially Exchangeable Random Partitions

A random partition of the positive integers is called partially exchangeable if for each finite sequence of positive integers n,, ... , nk, the probability that the partition breaks the first n1 + + nk integers into k particular classes, of sizes nl,.. . ., nk in order of their first elements, has the same value p(nl,...,nk) for every possible choice of classes subject to the sizes constraint. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Letters in Mathematical Physics

سال: 2021

ISSN: ['0377-9017', '1573-0530']

DOI: https://doi.org/10.1007/s11005-021-01389-y